Generating All the Minimal Separators of a Graph
نویسندگان
چکیده
We present an eecient algorithm which computes the set of minimal separators of a graph in O(n 3) time per separator, thus gaining a factor of n 2 on the current best-time algorithms for this problem. Our process is based on a new structural result, derived from Kloks and Kratsch's work on listing all the minimal separators of a graph.
منابع مشابه
Listing all the minimal separators of a planar graph
I present an efficient algorithm which lists the minimal separators of a planar graph in O(n) per separator.
متن کاملMinimal separators in P4-sparse graphs
In this paper, we determine the minimal separators of P4-sparse graphs and establish bounds on their number. Specifically, we show that a P4-sparse graph G on n vertices and m edges has fewer than 2n/3 minimal separators of total description size at most 4m/3. The bound on the number of minimal separators is tight and is also tight for the class of cographs, a well known subclass of the P4-spar...
متن کاملGraph extremities and minimal separation
A. Berry Abstra t: Many problems related to knowledge dis overy an be modelized by an undire ted graph, whi h in turn has a strong stru ture asso iated with its minimal separators. On several well-known graph lasses whi h are used in appli ations, the graph extremities and the related elimination orderings are an eÆ ient algorithmi tool. Often, these extremities turn out to be related to the mi...
متن کاملListing all the minimal separators of a 3-connected planar graph
We present an efficient algorithm that lists the minimal separators of a 3-connected planar graph in O(n) per separator.
متن کاملFinding All Minimal Separators of a Graph
In this paper we give an efficient algorithm to find all minimal vertex separators of an undirected graph. The algorithm needs polynomial time per separat.or that. is found.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 11 شماره
صفحات -
تاریخ انتشار 1999